A GRASP algorithm to solve the unicost set covering problem

The set covering problem (SCP) is a wellknown combinatorial optimization problem. We present a GRASP algorithm to Unicost Set Covering Problem, a special case of the Set Covering Problem where no distinction is made between covering sets. The most significant contribution of the algorithm is the incorporation of a local improvement procedure based on the heuristics to solve satisfiability problems (SAT). The quality of the proposed algorithm is tested on a set of reference instances, comparing the obtained results with those found in the literature. Our algorithm improves the best known solutions for many of these instances.